Network Coding Capacity Regions via Entropy Functions
نویسندگان
چکیده
منابع مشابه
On Network Coding Capacity - Matroidal Networks and Network Capacity Regions
One fundamental problem in the field of network coding is to determine the network coding capacity of networks under various network coding schemes. In this thesis, we address the problem with two approaches: matroidal networks and capacity regions. In our matroidal approach, we prove the converse of the theorem which states that, if a network is scalar-linearly solvable then it is a matroidal ...
متن کاملExplicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation
The problem of automating rate region converse proofs in multi-source network coding is considered, and an algorithm for explicitly computing polyhedral outer bounds on the rate regions of multi-source network coding instances using known bounds on the entropy function region is proposed. This algorithm is based on the Convex Hull Method, which is an algorithm to compute projections of polyhedr...
متن کاملGraph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be bounded from below with the number of vertices minus the size of the graph’s shortest index code. We show that the Network Coding solvability of each specific multiple unicast n...
متن کاملImproved Transport Capacity of the Hexagonal Lattice Network with Broadcast via Network Coding
The capacity of a wireless lattice network with local interference is studied. In particular, the transport capacity under a multiple unicast traffic pattern is studied for a network of nodes placed on the hexagonal lattice. The communication model is that local interference allows reliable broadcast to all neighbors, but that simultaneous transmissions from multiple neighbors lead to a collisi...
متن کاملCapacity and Achievable Rate Regions for Linear Network Coding over Ring Alphabets
The rate of a network code is the ratio of the block size of the network’s messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of networks using finite field alphabets to the more general cases of arbitrary ring and module alphabets. For non-commutative rings, two-sided linearity is allowed. Specifically, we prove the following for directed acycl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2334291